On the Coherence Conditions for Pseudo-distributive Laws

نویسندگان

  • NICOLA GAMBINO
  • N. GAMBINO
چکیده

The formal theory of monads, originally introduced by Street in [22] and developed further by Lack and Street [17] provides a mathematically efficient treatment of several aspects of the theory of monads [1]. For example, it exhibits a universal property of the category of algebras for a monad and provides a clear explanation for Beck’s axioms for a distributive law [2]. Over the past few years, there has been substatial progress in the development of a formal theory of pseudo-monads [4, 15, 19, 20, 21, 23, 24], with applications to pure mathematics [7, 8] and theoretical computer science [3, 5, 25]. Our aim here is to give a survey this development, both to facilitate further applications and to provide a reference for future work. We shall focus our attention on the formulation of coherence conditions, which has proved to be one of the most delicate aspects of the theory. Just as the formal theory of monads is developed within two-dimensional category theory [14], the formal theory of pseudo-monads is developed within three-dimensional category theory [10]. Within this setting, it is convenient to work with Gray-categories, which are semistrict tricategories [10, Section 4.8]. Working with Gray-categories is easier than working with general tricategories, but does not lead to an essential loss of generality, since every tricategory is triequivalent to a Gray-category [10, Theorem 8.1]. The starting point of the formal theory of pseudo-monads is the definition, for a Gray-category K, of the Gray-category PsmK of pseudo-monads in K. As we will see, this is done following a different approach to the one taken in the formal theory of monads to define the 2-category of monads in a 2category. The change of approach allows one to avoid building into the definition of PsmK the notions of a pseudo-monad morphism, pseudo-monad transformation, and pseudo-monad modification, which involve complex coherence conditions. These notions can be introduced at a later stage and then shown to lead to a tricategory that is triequivalent to PsmK.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-distributive laws

We address the question of how elegantly to combine a number of different structures, such as finite product structure, monoidal structure, and colimiting structure, on a category. Extending work of Marmolejo and Lack, we develop the definition of a pseudo-distributive law between pseudo-monads, and we show how the definition and the main theorems about it may be used to model several such stru...

متن کامل

Commutative pseudo BE-algebras

The aim of this paper is to introduce the notion of commutative pseudo BE-algebras and investigate their properties.We generalize some results proved by A. Walendziak for the case of commutative BE-algebras.We prove that the class of commutative pseudo BE-algebras is equivalent to the class of commutative pseudo BCK-algebras. Based on this result, all results holding for commutative pseudo BCK-...

متن کامل

Polycategories via pseudo-distributive laws

In this paper, we give a novel abstract description of Szabo’s polycategories. We use the theory of double clubs – a generalisation of Kelly’s theory of clubs to ‘pseudo’ (or ‘weak’) double categories – to construct a pseudo-distributive law of the free symmetric strict monoidal category pseudocomonad onMod over itself qua pseudomonad, and show that monads in the ‘two-sided Kleisli bicategory’ ...

متن کامل

Distributive laws in programming structures

Generalised Distributive laws in Computer Science are rules governing the transformation of one programming structure into another. In programming, they are programs satisfying certain formal conditions. Their importance has been to date documented in several isolated cases by diverse formal approaches. These applications have always meant leaps in understanding the nature of the subject. Howev...

متن کامل

DISTRIBUTIVE LAWS AND FACTORIZATION Dedicated to Max Kelly on his th birthday

This article shows that the distributive laws of Beck in the bicategory of sets and matrices wherein monads are categories determine strict factorization systems on their composite monads Conversely it is shown that strict factorization systems on categories give rise to distributive laws Moreover these processes are shown to be mutually inverse in a precise sense Strict factorization systems a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009